<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<title>Source code</title>
<link rel="stylesheet" type="text/css" href="../../../../../stylesheet.css" title="Style">
</head>
<body>
<div class="sourceContainer">
<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
<span class="sourceLineNo">002</span> * Copyright (C) 2011 The Guava Authors<a name="line.2"></a>
<span class="sourceLineNo">003</span> *<a name="line.3"></a>
<span class="sourceLineNo">004</span> * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except<a name="line.4"></a>
<span class="sourceLineNo">005</span> * in compliance with the License. You may obtain a copy of the License at<a name="line.5"></a>
<span class="sourceLineNo">006</span> *<a name="line.6"></a>
<span class="sourceLineNo">007</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.7"></a>
<span class="sourceLineNo">008</span> *<a name="line.8"></a>
<span class="sourceLineNo">009</span> * Unless required by applicable law or agreed to in writing, software distributed under the<a name="line.9"></a>
<span class="sourceLineNo">010</span> * License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either<a name="line.10"></a>
<span class="sourceLineNo">011</span> * express or implied. See the License for the specific language governing permissions and<a name="line.11"></a>
<span class="sourceLineNo">012</span> * limitations under the License.<a name="line.12"></a>
<span class="sourceLineNo">013</span> */<a name="line.13"></a>
<span class="sourceLineNo">014</span><a name="line.14"></a>
<span class="sourceLineNo">015</span>package com.google.common.primitives;<a name="line.15"></a>
<span class="sourceLineNo">016</span><a name="line.16"></a>
<span class="sourceLineNo">017</span>import static com.google.common.base.Preconditions.checkArgument;<a name="line.17"></a>
<span class="sourceLineNo">018</span>import static com.google.common.base.Preconditions.checkNotNull;<a name="line.18"></a>
<span class="sourceLineNo">019</span><a name="line.19"></a>
<span class="sourceLineNo">020</span>import com.google.common.annotations.Beta;<a name="line.20"></a>
<span class="sourceLineNo">021</span>import com.google.common.annotations.GwtCompatible;<a name="line.21"></a>
<span class="sourceLineNo">022</span><a name="line.22"></a>
<span class="sourceLineNo">023</span>import java.math.BigInteger;<a name="line.23"></a>
<span class="sourceLineNo">024</span>import java.util.Arrays;<a name="line.24"></a>
<span class="sourceLineNo">025</span>import java.util.Comparator;<a name="line.25"></a>
<span class="sourceLineNo">026</span><a name="line.26"></a>
<span class="sourceLineNo">027</span>/**<a name="line.27"></a>
<span class="sourceLineNo">028</span> * Static utility methods pertaining to {@code long} primitives that interpret values as<a name="line.28"></a>
<span class="sourceLineNo">029</span> * &lt;i&gt;unsigned&lt;/i&gt; (that is, any negative value {@code x} is treated as the positive value<a name="line.29"></a>
<span class="sourceLineNo">030</span> * {@code 2^64 + x}). The methods for which signedness is not an issue are in {@link Longs}, as<a name="line.30"></a>
<span class="sourceLineNo">031</span> * well as signed versions of methods for which signedness is an issue.<a name="line.31"></a>
<span class="sourceLineNo">032</span> *<a name="line.32"></a>
<span class="sourceLineNo">033</span> * &lt;p&gt;In addition, this class provides several static methods for converting a {@code long} to a<a name="line.33"></a>
<span class="sourceLineNo">034</span> * {@code String} and a {@code String} to a {@code long} that treat the {@code long} as an unsigned<a name="line.34"></a>
<span class="sourceLineNo">035</span> * number.<a name="line.35"></a>
<span class="sourceLineNo">036</span> *<a name="line.36"></a>
<span class="sourceLineNo">037</span> * &lt;p&gt;Users of these utilities must be &lt;i&gt;extremely careful&lt;/i&gt; not to mix up signed and unsigned<a name="line.37"></a>
<span class="sourceLineNo">038</span> * {@code long} values. When possible, it is recommended that the {@link UnsignedLong} wrapper<a name="line.38"></a>
<span class="sourceLineNo">039</span> * class be used, at a small efficiency penalty, to enforce the distinction in the type system.<a name="line.39"></a>
<span class="sourceLineNo">040</span> *<a name="line.40"></a>
<span class="sourceLineNo">041</span> * &lt;p&gt;See the Guava User Guide article on &lt;a href=<a name="line.41"></a>
<span class="sourceLineNo">042</span> * "http://code.google.com/p/guava-libraries/wiki/PrimitivesExplained#Unsigned_support"&gt;<a name="line.42"></a>
<span class="sourceLineNo">043</span> * unsigned primitive utilities&lt;/a&gt;.<a name="line.43"></a>
<span class="sourceLineNo">044</span> *<a name="line.44"></a>
<span class="sourceLineNo">045</span> * @author Louis Wasserman<a name="line.45"></a>
<span class="sourceLineNo">046</span> * @author Brian Milch<a name="line.46"></a>
<span class="sourceLineNo">047</span> * @author Colin Evans<a name="line.47"></a>
<span class="sourceLineNo">048</span> * @since 10.0<a name="line.48"></a>
<span class="sourceLineNo">049</span> */<a name="line.49"></a>
<span class="sourceLineNo">050</span>@Beta<a name="line.50"></a>
<span class="sourceLineNo">051</span>@GwtCompatible<a name="line.51"></a>
<span class="sourceLineNo">052</span>public final class UnsignedLongs {<a name="line.52"></a>
<span class="sourceLineNo">053</span>  private UnsignedLongs() {}<a name="line.53"></a>
<span class="sourceLineNo">054</span><a name="line.54"></a>
<span class="sourceLineNo">055</span>  public static final long MAX_VALUE = -1L; // Equivalent to 2^64 - 1<a name="line.55"></a>
<span class="sourceLineNo">056</span><a name="line.56"></a>
<span class="sourceLineNo">057</span>  /**<a name="line.57"></a>
<span class="sourceLineNo">058</span>   * A (self-inverse) bijection which converts the ordering on unsigned longs to the ordering on<a name="line.58"></a>
<span class="sourceLineNo">059</span>   * longs, that is, {@code a &lt;= b} as unsigned longs if and only if {@code flip(a) &lt;= flip(b)}<a name="line.59"></a>
<span class="sourceLineNo">060</span>   * as signed longs.<a name="line.60"></a>
<span class="sourceLineNo">061</span>   */<a name="line.61"></a>
<span class="sourceLineNo">062</span>  private static long flip(long a) {<a name="line.62"></a>
<span class="sourceLineNo">063</span>    return a ^ Long.MIN_VALUE;<a name="line.63"></a>
<span class="sourceLineNo">064</span>  }<a name="line.64"></a>
<span class="sourceLineNo">065</span><a name="line.65"></a>
<span class="sourceLineNo">066</span>  /**<a name="line.66"></a>
<span class="sourceLineNo">067</span>   * Compares the two specified {@code long} values, treating them as unsigned values between<a name="line.67"></a>
<span class="sourceLineNo">068</span>   * {@code 0} and {@code 2^64 - 1} inclusive.<a name="line.68"></a>
<span class="sourceLineNo">069</span>   *<a name="line.69"></a>
<span class="sourceLineNo">070</span>   * @param a the first unsigned {@code long} to compare<a name="line.70"></a>
<span class="sourceLineNo">071</span>   * @param b the second unsigned {@code long} to compare<a name="line.71"></a>
<span class="sourceLineNo">072</span>   * @return a negative value if {@code a} is less than {@code b}; a positive value if {@code a} is<a name="line.72"></a>
<span class="sourceLineNo">073</span>   *         greater than {@code b}; or zero if they are equal<a name="line.73"></a>
<span class="sourceLineNo">074</span>   */<a name="line.74"></a>
<span class="sourceLineNo">075</span>  public static int compare(long a, long b) {<a name="line.75"></a>
<span class="sourceLineNo">076</span>    return Longs.compare(flip(a), flip(b));<a name="line.76"></a>
<span class="sourceLineNo">077</span>  }<a name="line.77"></a>
<span class="sourceLineNo">078</span><a name="line.78"></a>
<span class="sourceLineNo">079</span>  /**<a name="line.79"></a>
<span class="sourceLineNo">080</span>   * Returns the least value present in {@code array}, treating values as unsigned.<a name="line.80"></a>
<span class="sourceLineNo">081</span>   *<a name="line.81"></a>
<span class="sourceLineNo">082</span>   * @param array a &lt;i&gt;nonempty&lt;/i&gt; array of unsigned {@code long} values<a name="line.82"></a>
<span class="sourceLineNo">083</span>   * @return the value present in {@code array} that is less than or equal to every other value in<a name="line.83"></a>
<span class="sourceLineNo">084</span>   *         the array according to {@link #compare}<a name="line.84"></a>
<span class="sourceLineNo">085</span>   * @throws IllegalArgumentException if {@code array} is empty<a name="line.85"></a>
<span class="sourceLineNo">086</span>   */<a name="line.86"></a>
<span class="sourceLineNo">087</span>  public static long min(long... array) {<a name="line.87"></a>
<span class="sourceLineNo">088</span>    checkArgument(array.length &gt; 0);<a name="line.88"></a>
<span class="sourceLineNo">089</span>    long min = flip(array[0]);<a name="line.89"></a>
<span class="sourceLineNo">090</span>    for (int i = 1; i &lt; array.length; i++) {<a name="line.90"></a>
<span class="sourceLineNo">091</span>      long next = flip(array[i]);<a name="line.91"></a>
<span class="sourceLineNo">092</span>      if (next &lt; min) {<a name="line.92"></a>
<span class="sourceLineNo">093</span>        min = next;<a name="line.93"></a>
<span class="sourceLineNo">094</span>      }<a name="line.94"></a>
<span class="sourceLineNo">095</span>    }<a name="line.95"></a>
<span class="sourceLineNo">096</span>    return flip(min);<a name="line.96"></a>
<span class="sourceLineNo">097</span>  }<a name="line.97"></a>
<span class="sourceLineNo">098</span><a name="line.98"></a>
<span class="sourceLineNo">099</span>  /**<a name="line.99"></a>
<span class="sourceLineNo">100</span>   * Returns the greatest value present in {@code array}, treating values as unsigned.<a name="line.100"></a>
<span class="sourceLineNo">101</span>   *<a name="line.101"></a>
<span class="sourceLineNo">102</span>   * @param array a &lt;i&gt;nonempty&lt;/i&gt; array of unsigned {@code long} values<a name="line.102"></a>
<span class="sourceLineNo">103</span>   * @return the value present in {@code array} that is greater than or equal to every other value<a name="line.103"></a>
<span class="sourceLineNo">104</span>   *         in the array according to {@link #compare}<a name="line.104"></a>
<span class="sourceLineNo">105</span>   * @throws IllegalArgumentException if {@code array} is empty<a name="line.105"></a>
<span class="sourceLineNo">106</span>   */<a name="line.106"></a>
<span class="sourceLineNo">107</span>  public static long max(long... array) {<a name="line.107"></a>
<span class="sourceLineNo">108</span>    checkArgument(array.length &gt; 0);<a name="line.108"></a>
<span class="sourceLineNo">109</span>    long max = flip(array[0]);<a name="line.109"></a>
<span class="sourceLineNo">110</span>    for (int i = 1; i &lt; array.length; i++) {<a name="line.110"></a>
<span class="sourceLineNo">111</span>      long next = flip(array[i]);<a name="line.111"></a>
<span class="sourceLineNo">112</span>      if (next &gt; max) {<a name="line.112"></a>
<span class="sourceLineNo">113</span>        max = next;<a name="line.113"></a>
<span class="sourceLineNo">114</span>      }<a name="line.114"></a>
<span class="sourceLineNo">115</span>    }<a name="line.115"></a>
<span class="sourceLineNo">116</span>    return flip(max);<a name="line.116"></a>
<span class="sourceLineNo">117</span>  }<a name="line.117"></a>
<span class="sourceLineNo">118</span><a name="line.118"></a>
<span class="sourceLineNo">119</span>  /**<a name="line.119"></a>
<span class="sourceLineNo">120</span>   * Returns a string containing the supplied unsigned {@code long} values separated by<a name="line.120"></a>
<span class="sourceLineNo">121</span>   * {@code separator}. For example, {@code join("-", 1, 2, 3)} returns the string {@code "1-2-3"}.<a name="line.121"></a>
<span class="sourceLineNo">122</span>   *<a name="line.122"></a>
<span class="sourceLineNo">123</span>   * @param separator the text that should appear between consecutive values in the resulting<a name="line.123"></a>
<span class="sourceLineNo">124</span>   *        string (but not at the start or end)<a name="line.124"></a>
<span class="sourceLineNo">125</span>   * @param array an array of unsigned {@code long} values, possibly empty<a name="line.125"></a>
<span class="sourceLineNo">126</span>   */<a name="line.126"></a>
<span class="sourceLineNo">127</span>  public static String join(String separator, long... array) {<a name="line.127"></a>
<span class="sourceLineNo">128</span>    checkNotNull(separator);<a name="line.128"></a>
<span class="sourceLineNo">129</span>    if (array.length == 0) {<a name="line.129"></a>
<span class="sourceLineNo">130</span>      return "";<a name="line.130"></a>
<span class="sourceLineNo">131</span>    }<a name="line.131"></a>
<span class="sourceLineNo">132</span><a name="line.132"></a>
<span class="sourceLineNo">133</span>    // For pre-sizing a builder, just get the right order of magnitude<a name="line.133"></a>
<span class="sourceLineNo">134</span>    StringBuilder builder = new StringBuilder(array.length * 5);<a name="line.134"></a>
<span class="sourceLineNo">135</span>    builder.append(toString(array[0]));<a name="line.135"></a>
<span class="sourceLineNo">136</span>    for (int i = 1; i &lt; array.length; i++) {<a name="line.136"></a>
<span class="sourceLineNo">137</span>      builder.append(separator).append(toString(array[i]));<a name="line.137"></a>
<span class="sourceLineNo">138</span>    }<a name="line.138"></a>
<span class="sourceLineNo">139</span>    return builder.toString();<a name="line.139"></a>
<span class="sourceLineNo">140</span>  }<a name="line.140"></a>
<span class="sourceLineNo">141</span><a name="line.141"></a>
<span class="sourceLineNo">142</span>  /**<a name="line.142"></a>
<span class="sourceLineNo">143</span>   * Returns a comparator that compares two arrays of unsigned {@code long} values<a name="line.143"></a>
<span class="sourceLineNo">144</span>   * lexicographically. That is, it compares, using {@link #compare(long, long)}), the first pair of<a name="line.144"></a>
<span class="sourceLineNo">145</span>   * values that follow any common prefix, or when one array is a prefix of the other, treats the<a name="line.145"></a>
<span class="sourceLineNo">146</span>   * shorter array as the lesser. For example, {@code [] &lt; [1L] &lt; [1L, 2L] &lt; [2L] &lt; [1L &lt;&lt; 63]}.<a name="line.146"></a>
<span class="sourceLineNo">147</span>   *<a name="line.147"></a>
<span class="sourceLineNo">148</span>   * &lt;p&gt;The returned comparator is inconsistent with {@link Object#equals(Object)} (since arrays<a name="line.148"></a>
<span class="sourceLineNo">149</span>   * support only identity equality), but it is consistent with<a name="line.149"></a>
<span class="sourceLineNo">150</span>   * {@link Arrays#equals(long[], long[])}.<a name="line.150"></a>
<span class="sourceLineNo">151</span>   *<a name="line.151"></a>
<span class="sourceLineNo">152</span>   * @see &lt;a href="http://en.wikipedia.org/wiki/Lexicographical_order"&gt;Lexicographical order<a name="line.152"></a>
<span class="sourceLineNo">153</span>   *      article at Wikipedia&lt;/a&gt;<a name="line.153"></a>
<span class="sourceLineNo">154</span>   */<a name="line.154"></a>
<span class="sourceLineNo">155</span>  public static Comparator&lt;long[]&gt; lexicographicalComparator() {<a name="line.155"></a>
<span class="sourceLineNo">156</span>    return LexicographicalComparator.INSTANCE;<a name="line.156"></a>
<span class="sourceLineNo">157</span>  }<a name="line.157"></a>
<span class="sourceLineNo">158</span><a name="line.158"></a>
<span class="sourceLineNo">159</span>  enum LexicographicalComparator implements Comparator&lt;long[]&gt; {<a name="line.159"></a>
<span class="sourceLineNo">160</span>    INSTANCE;<a name="line.160"></a>
<span class="sourceLineNo">161</span><a name="line.161"></a>
<span class="sourceLineNo">162</span>    @Override<a name="line.162"></a>
<span class="sourceLineNo">163</span>    public int compare(long[] left, long[] right) {<a name="line.163"></a>
<span class="sourceLineNo">164</span>      int minLength = Math.min(left.length, right.length);<a name="line.164"></a>
<span class="sourceLineNo">165</span>      for (int i = 0; i &lt; minLength; i++) {<a name="line.165"></a>
<span class="sourceLineNo">166</span>        if (left[i] != right[i]) {<a name="line.166"></a>
<span class="sourceLineNo">167</span>          return UnsignedLongs.compare(left[i], right[i]);<a name="line.167"></a>
<span class="sourceLineNo">168</span>        }<a name="line.168"></a>
<span class="sourceLineNo">169</span>      }<a name="line.169"></a>
<span class="sourceLineNo">170</span>      return left.length - right.length;<a name="line.170"></a>
<span class="sourceLineNo">171</span>    }<a name="line.171"></a>
<span class="sourceLineNo">172</span>  }<a name="line.172"></a>
<span class="sourceLineNo">173</span><a name="line.173"></a>
<span class="sourceLineNo">174</span>  /**<a name="line.174"></a>
<span class="sourceLineNo">175</span>   * Returns dividend / divisor, where the dividend and divisor are treated as unsigned 64-bit<a name="line.175"></a>
<span class="sourceLineNo">176</span>   * quantities.<a name="line.176"></a>
<span class="sourceLineNo">177</span>   *<a name="line.177"></a>
<span class="sourceLineNo">178</span>   * @param dividend the dividend (numerator)<a name="line.178"></a>
<span class="sourceLineNo">179</span>   * @param divisor the divisor (denominator)<a name="line.179"></a>
<span class="sourceLineNo">180</span>   * @throws ArithmeticException if divisor is 0<a name="line.180"></a>
<span class="sourceLineNo">181</span>   */<a name="line.181"></a>
<span class="sourceLineNo">182</span>  public static long divide(long dividend, long divisor) {<a name="line.182"></a>
<span class="sourceLineNo">183</span>    if (divisor &lt; 0) { // i.e., divisor &gt;= 2^63:<a name="line.183"></a>
<span class="sourceLineNo">184</span>      if (compare(dividend, divisor) &lt; 0) {<a name="line.184"></a>
<span class="sourceLineNo">185</span>        return 0; // dividend &lt; divisor<a name="line.185"></a>
<span class="sourceLineNo">186</span>      } else {<a name="line.186"></a>
<span class="sourceLineNo">187</span>        return 1; // dividend &gt;= divisor<a name="line.187"></a>
<span class="sourceLineNo">188</span>      }<a name="line.188"></a>
<span class="sourceLineNo">189</span>    }<a name="line.189"></a>
<span class="sourceLineNo">190</span><a name="line.190"></a>
<span class="sourceLineNo">191</span>    // Optimization - use signed division if dividend &lt; 2^63<a name="line.191"></a>
<span class="sourceLineNo">192</span>    if (dividend &gt;= 0) {<a name="line.192"></a>
<span class="sourceLineNo">193</span>      return dividend / divisor;<a name="line.193"></a>
<span class="sourceLineNo">194</span>    }<a name="line.194"></a>
<span class="sourceLineNo">195</span><a name="line.195"></a>
<span class="sourceLineNo">196</span>    /*<a name="line.196"></a>
<span class="sourceLineNo">197</span>     * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is<a name="line.197"></a>
<span class="sourceLineNo">198</span>     * guaranteed to be either exact or one less than the correct value. This follows from fact<a name="line.198"></a>
<span class="sourceLineNo">199</span>     * that floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not<a name="line.199"></a>
<span class="sourceLineNo">200</span>     * quite trivial.<a name="line.200"></a>
<span class="sourceLineNo">201</span>     */<a name="line.201"></a>
<span class="sourceLineNo">202</span>    long quotient = ((dividend &gt;&gt;&gt; 1) / divisor) &lt;&lt; 1;<a name="line.202"></a>
<span class="sourceLineNo">203</span>    long rem = dividend - quotient * divisor;<a name="line.203"></a>
<span class="sourceLineNo">204</span>    return quotient + (compare(rem, divisor) &gt;= 0 ? 1 : 0);<a name="line.204"></a>
<span class="sourceLineNo">205</span>  }<a name="line.205"></a>
<span class="sourceLineNo">206</span><a name="line.206"></a>
<span class="sourceLineNo">207</span>  /**<a name="line.207"></a>
<span class="sourceLineNo">208</span>   * Returns dividend % divisor, where the dividend and divisor are treated as unsigned 64-bit<a name="line.208"></a>
<span class="sourceLineNo">209</span>   * quantities.<a name="line.209"></a>
<span class="sourceLineNo">210</span>   *<a name="line.210"></a>
<span class="sourceLineNo">211</span>   * @param dividend the dividend (numerator)<a name="line.211"></a>
<span class="sourceLineNo">212</span>   * @param divisor the divisor (denominator)<a name="line.212"></a>
<span class="sourceLineNo">213</span>   * @throws ArithmeticException if divisor is 0<a name="line.213"></a>
<span class="sourceLineNo">214</span>   * @since 11.0<a name="line.214"></a>
<span class="sourceLineNo">215</span>   */<a name="line.215"></a>
<span class="sourceLineNo">216</span>  public static long remainder(long dividend, long divisor) {<a name="line.216"></a>
<span class="sourceLineNo">217</span>    if (divisor &lt; 0) { // i.e., divisor &gt;= 2^63:<a name="line.217"></a>
<span class="sourceLineNo">218</span>      if (compare(dividend, divisor) &lt; 0) {<a name="line.218"></a>
<span class="sourceLineNo">219</span>        return dividend; // dividend &lt; divisor<a name="line.219"></a>
<span class="sourceLineNo">220</span>      } else {<a name="line.220"></a>
<span class="sourceLineNo">221</span>        return dividend - divisor; // dividend &gt;= divisor<a name="line.221"></a>
<span class="sourceLineNo">222</span>      }<a name="line.222"></a>
<span class="sourceLineNo">223</span>    }<a name="line.223"></a>
<span class="sourceLineNo">224</span><a name="line.224"></a>
<span class="sourceLineNo">225</span>    // Optimization - use signed modulus if dividend &lt; 2^63<a name="line.225"></a>
<span class="sourceLineNo">226</span>    if (dividend &gt;= 0) {<a name="line.226"></a>
<span class="sourceLineNo">227</span>      return dividend % divisor;<a name="line.227"></a>
<span class="sourceLineNo">228</span>    }<a name="line.228"></a>
<span class="sourceLineNo">229</span><a name="line.229"></a>
<span class="sourceLineNo">230</span>    /*<a name="line.230"></a>
<span class="sourceLineNo">231</span>     * Otherwise, approximate the quotient, check, and correct if necessary. Our approximation is<a name="line.231"></a>
<span class="sourceLineNo">232</span>     * guaranteed to be either exact or one less than the correct value. This follows from fact<a name="line.232"></a>
<span class="sourceLineNo">233</span>     * that floor(floor(x)/i) == floor(x/i) for any real x and integer i != 0. The proof is not<a name="line.233"></a>
<span class="sourceLineNo">234</span>     * quite trivial.<a name="line.234"></a>
<span class="sourceLineNo">235</span>     */<a name="line.235"></a>
<span class="sourceLineNo">236</span>    long quotient = ((dividend &gt;&gt;&gt; 1) / divisor) &lt;&lt; 1;<a name="line.236"></a>
<span class="sourceLineNo">237</span>    long rem = dividend - quotient * divisor;<a name="line.237"></a>
<span class="sourceLineNo">238</span>    return rem - (compare(rem, divisor) &gt;= 0 ? divisor : 0);<a name="line.238"></a>
<span class="sourceLineNo">239</span>  }<a name="line.239"></a>
<span class="sourceLineNo">240</span><a name="line.240"></a>
<span class="sourceLineNo">241</span>  /**<a name="line.241"></a>
<span class="sourceLineNo">242</span>   * Returns the unsigned {@code long} value represented by the given decimal string.<a name="line.242"></a>
<span class="sourceLineNo">243</span>   *<a name="line.243"></a>
<span class="sourceLineNo">244</span>   * @throws NumberFormatException if the string does not contain a valid unsigned {@code long}<a name="line.244"></a>
<span class="sourceLineNo">245</span>   *         value<a name="line.245"></a>
<span class="sourceLineNo">246</span>   * @throws NullPointerException if {@code s} is null <a name="line.246"></a>
<span class="sourceLineNo">247</span>   *         (in contrast to {@link Long#parseLong(String)})<a name="line.247"></a>
<span class="sourceLineNo">248</span>   */<a name="line.248"></a>
<span class="sourceLineNo">249</span>  public static long parseUnsignedLong(String s) {<a name="line.249"></a>
<span class="sourceLineNo">250</span>    return parseUnsignedLong(s, 10);<a name="line.250"></a>
<span class="sourceLineNo">251</span>  }<a name="line.251"></a>
<span class="sourceLineNo">252</span><a name="line.252"></a>
<span class="sourceLineNo">253</span>  /**<a name="line.253"></a>
<span class="sourceLineNo">254</span>   * Returns the unsigned {@code long} value represented by the given string.<a name="line.254"></a>
<span class="sourceLineNo">255</span>   *<a name="line.255"></a>
<span class="sourceLineNo">256</span>   * Accepts a decimal, hexadecimal, or octal number given by specifying the following prefix:<a name="line.256"></a>
<span class="sourceLineNo">257</span>   *<a name="line.257"></a>
<span class="sourceLineNo">258</span>   * &lt;ul&gt;<a name="line.258"></a>
<span class="sourceLineNo">259</span>   * &lt;li&gt;{@code 0x}&lt;i&gt;HexDigits&lt;/i&gt;<a name="line.259"></a>
<span class="sourceLineNo">260</span>   * &lt;li&gt;{@code 0X}&lt;i&gt;HexDigits&lt;/i&gt;<a name="line.260"></a>
<span class="sourceLineNo">261</span>   * &lt;li&gt;{@code #}&lt;i&gt;HexDigits&lt;/i&gt;<a name="line.261"></a>
<span class="sourceLineNo">262</span>   * &lt;li&gt;{@code 0}&lt;i&gt;OctalDigits&lt;/i&gt;<a name="line.262"></a>
<span class="sourceLineNo">263</span>   * &lt;/ul&gt;<a name="line.263"></a>
<span class="sourceLineNo">264</span>   *<a name="line.264"></a>
<span class="sourceLineNo">265</span>   * @throws NumberFormatException if the string does not contain a valid unsigned {@code long}<a name="line.265"></a>
<span class="sourceLineNo">266</span>   *         value<a name="line.266"></a>
<span class="sourceLineNo">267</span>   * @since 13.0<a name="line.267"></a>
<span class="sourceLineNo">268</span>   */<a name="line.268"></a>
<span class="sourceLineNo">269</span>  public static long decode(String stringValue) {<a name="line.269"></a>
<span class="sourceLineNo">270</span>    ParseRequest request = ParseRequest.fromString(stringValue);<a name="line.270"></a>
<span class="sourceLineNo">271</span><a name="line.271"></a>
<span class="sourceLineNo">272</span>    try {<a name="line.272"></a>
<span class="sourceLineNo">273</span>      return parseUnsignedLong(request.rawValue, request.radix);<a name="line.273"></a>
<span class="sourceLineNo">274</span>    } catch (NumberFormatException e) {<a name="line.274"></a>
<span class="sourceLineNo">275</span>      NumberFormatException decodeException =<a name="line.275"></a>
<span class="sourceLineNo">276</span>          new NumberFormatException("Error parsing value: " + stringValue);<a name="line.276"></a>
<span class="sourceLineNo">277</span>      decodeException.initCause(e);<a name="line.277"></a>
<span class="sourceLineNo">278</span>      throw decodeException;<a name="line.278"></a>
<span class="sourceLineNo">279</span>    }<a name="line.279"></a>
<span class="sourceLineNo">280</span>  }<a name="line.280"></a>
<span class="sourceLineNo">281</span><a name="line.281"></a>
<span class="sourceLineNo">282</span>  /**<a name="line.282"></a>
<span class="sourceLineNo">283</span>   * Returns the unsigned {@code long} value represented by a string with the given radix.<a name="line.283"></a>
<span class="sourceLineNo">284</span>   *<a name="line.284"></a>
<span class="sourceLineNo">285</span>   * @param s the string containing the unsigned {@code long} representation to be parsed.<a name="line.285"></a>
<span class="sourceLineNo">286</span>   * @param radix the radix to use while parsing {@code s}<a name="line.286"></a>
<span class="sourceLineNo">287</span>   * @throws NumberFormatException if the string does not contain a valid unsigned {@code long}<a name="line.287"></a>
<span class="sourceLineNo">288</span>   *         with the given radix, or if {@code radix} is not between {@link Character#MIN_RADIX}<a name="line.288"></a>
<span class="sourceLineNo">289</span>   *         and {@link Character#MAX_RADIX}.<a name="line.289"></a>
<span class="sourceLineNo">290</span>   * @throws NullPointerException if {@code s} is null <a name="line.290"></a>
<span class="sourceLineNo">291</span>   *         (in contrast to {@link Long#parseLong(String)})<a name="line.291"></a>
<span class="sourceLineNo">292</span>   */<a name="line.292"></a>
<span class="sourceLineNo">293</span>  public static long parseUnsignedLong(String s, int radix) {<a name="line.293"></a>
<span class="sourceLineNo">294</span>    checkNotNull(s);<a name="line.294"></a>
<span class="sourceLineNo">295</span>    if (s.length() == 0) {<a name="line.295"></a>
<span class="sourceLineNo">296</span>      throw new NumberFormatException("empty string");<a name="line.296"></a>
<span class="sourceLineNo">297</span>    }<a name="line.297"></a>
<span class="sourceLineNo">298</span>    if (radix &lt; Character.MIN_RADIX || radix &gt; Character.MAX_RADIX) {<a name="line.298"></a>
<span class="sourceLineNo">299</span>      throw new NumberFormatException("illegal radix: " + radix);<a name="line.299"></a>
<span class="sourceLineNo">300</span>    }<a name="line.300"></a>
<span class="sourceLineNo">301</span><a name="line.301"></a>
<span class="sourceLineNo">302</span>    int max_safe_pos = maxSafeDigits[radix] - 1;<a name="line.302"></a>
<span class="sourceLineNo">303</span>    long value = 0;<a name="line.303"></a>
<span class="sourceLineNo">304</span>    for (int pos = 0; pos &lt; s.length(); pos++) {<a name="line.304"></a>
<span class="sourceLineNo">305</span>      int digit = Character.digit(s.charAt(pos), radix);<a name="line.305"></a>
<span class="sourceLineNo">306</span>      if (digit == -1) {<a name="line.306"></a>
<span class="sourceLineNo">307</span>        throw new NumberFormatException(s);<a name="line.307"></a>
<span class="sourceLineNo">308</span>      }<a name="line.308"></a>
<span class="sourceLineNo">309</span>      if (pos &gt; max_safe_pos &amp;&amp; overflowInParse(value, digit, radix)) {<a name="line.309"></a>
<span class="sourceLineNo">310</span>        throw new NumberFormatException("Too large for unsigned long: " + s);<a name="line.310"></a>
<span class="sourceLineNo">311</span>      }<a name="line.311"></a>
<span class="sourceLineNo">312</span>      value = (value * radix) + digit;<a name="line.312"></a>
<span class="sourceLineNo">313</span>    }<a name="line.313"></a>
<span class="sourceLineNo">314</span><a name="line.314"></a>
<span class="sourceLineNo">315</span>    return value;<a name="line.315"></a>
<span class="sourceLineNo">316</span>  }<a name="line.316"></a>
<span class="sourceLineNo">317</span><a name="line.317"></a>
<span class="sourceLineNo">318</span>  /**<a name="line.318"></a>
<span class="sourceLineNo">319</span>   * Returns true if (current * radix) + digit is a number too large to be represented by an<a name="line.319"></a>
<span class="sourceLineNo">320</span>   * unsigned long. This is useful for detecting overflow while parsing a string representation of<a name="line.320"></a>
<span class="sourceLineNo">321</span>   * a number. Does not verify whether supplied radix is valid, passing an invalid radix will give<a name="line.321"></a>
<span class="sourceLineNo">322</span>   * undefined results or an ArrayIndexOutOfBoundsException.<a name="line.322"></a>
<span class="sourceLineNo">323</span>   */<a name="line.323"></a>
<span class="sourceLineNo">324</span>  private static boolean overflowInParse(long current, int digit, int radix) {<a name="line.324"></a>
<span class="sourceLineNo">325</span>    if (current &gt;= 0) {<a name="line.325"></a>
<span class="sourceLineNo">326</span>      if (current &lt; maxValueDivs[radix]) {<a name="line.326"></a>
<span class="sourceLineNo">327</span>        return false;<a name="line.327"></a>
<span class="sourceLineNo">328</span>      }<a name="line.328"></a>
<span class="sourceLineNo">329</span>      if (current &gt; maxValueDivs[radix]) {<a name="line.329"></a>
<span class="sourceLineNo">330</span>        return true;<a name="line.330"></a>
<span class="sourceLineNo">331</span>      }<a name="line.331"></a>
<span class="sourceLineNo">332</span>      // current == maxValueDivs[radix]<a name="line.332"></a>
<span class="sourceLineNo">333</span>      return (digit &gt; maxValueMods[radix]);<a name="line.333"></a>
<span class="sourceLineNo">334</span>    }<a name="line.334"></a>
<span class="sourceLineNo">335</span><a name="line.335"></a>
<span class="sourceLineNo">336</span>    // current &lt; 0: high bit is set<a name="line.336"></a>
<span class="sourceLineNo">337</span>    return true;<a name="line.337"></a>
<span class="sourceLineNo">338</span>  }<a name="line.338"></a>
<span class="sourceLineNo">339</span><a name="line.339"></a>
<span class="sourceLineNo">340</span>  /**<a name="line.340"></a>
<span class="sourceLineNo">341</span>   * Returns a string representation of x, where x is treated as unsigned.<a name="line.341"></a>
<span class="sourceLineNo">342</span>   */<a name="line.342"></a>
<span class="sourceLineNo">343</span>  public static String toString(long x) {<a name="line.343"></a>
<span class="sourceLineNo">344</span>    return toString(x, 10);<a name="line.344"></a>
<span class="sourceLineNo">345</span>  }<a name="line.345"></a>
<span class="sourceLineNo">346</span><a name="line.346"></a>
<span class="sourceLineNo">347</span>  /**<a name="line.347"></a>
<span class="sourceLineNo">348</span>   * Returns a string representation of {@code x} for the given radix, where {@code x} is treated<a name="line.348"></a>
<span class="sourceLineNo">349</span>   * as unsigned.<a name="line.349"></a>
<span class="sourceLineNo">350</span>   *<a name="line.350"></a>
<span class="sourceLineNo">351</span>   * @param x the value to convert to a string.<a name="line.351"></a>
<span class="sourceLineNo">352</span>   * @param radix the radix to use while working with {@code x}<a name="line.352"></a>
<span class="sourceLineNo">353</span>   * @throws IllegalArgumentException if {@code radix} is not between {@link Character#MIN_RADIX}<a name="line.353"></a>
<span class="sourceLineNo">354</span>   *         and {@link Character#MAX_RADIX}.<a name="line.354"></a>
<span class="sourceLineNo">355</span>   */<a name="line.355"></a>
<span class="sourceLineNo">356</span>  public static String toString(long x, int radix) {<a name="line.356"></a>
<span class="sourceLineNo">357</span>    checkArgument(radix &gt;= Character.MIN_RADIX &amp;&amp; radix &lt;= Character.MAX_RADIX,<a name="line.357"></a>
<span class="sourceLineNo">358</span>        "radix (%s) must be between Character.MIN_RADIX and Character.MAX_RADIX", radix);<a name="line.358"></a>
<span class="sourceLineNo">359</span>    if (x == 0) {<a name="line.359"></a>
<span class="sourceLineNo">360</span>      // Simply return "0"<a name="line.360"></a>
<span class="sourceLineNo">361</span>      return "0";<a name="line.361"></a>
<span class="sourceLineNo">362</span>    } else {<a name="line.362"></a>
<span class="sourceLineNo">363</span>      char[] buf = new char[64];<a name="line.363"></a>
<span class="sourceLineNo">364</span>      int i = buf.length;<a name="line.364"></a>
<span class="sourceLineNo">365</span>      if (x &lt; 0) {<a name="line.365"></a>
<span class="sourceLineNo">366</span>        // Separate off the last digit using unsigned division. That will leave<a name="line.366"></a>
<span class="sourceLineNo">367</span>        // a number that is nonnegative as a signed integer.<a name="line.367"></a>
<span class="sourceLineNo">368</span>        long quotient = divide(x, radix);<a name="line.368"></a>
<span class="sourceLineNo">369</span>        long rem = x - quotient * radix;<a name="line.369"></a>
<span class="sourceLineNo">370</span>        buf[--i] = Character.forDigit((int) rem, radix);<a name="line.370"></a>
<span class="sourceLineNo">371</span>        x = quotient;<a name="line.371"></a>
<span class="sourceLineNo">372</span>      }<a name="line.372"></a>
<span class="sourceLineNo">373</span>      // Simple modulo/division approach<a name="line.373"></a>
<span class="sourceLineNo">374</span>      while (x &gt; 0) {<a name="line.374"></a>
<span class="sourceLineNo">375</span>        buf[--i] = Character.forDigit((int) (x % radix), radix);<a name="line.375"></a>
<span class="sourceLineNo">376</span>        x /= radix;<a name="line.376"></a>
<span class="sourceLineNo">377</span>      }<a name="line.377"></a>
<span class="sourceLineNo">378</span>      // Generate string<a name="line.378"></a>
<span class="sourceLineNo">379</span>      return new String(buf, i, buf.length - i);<a name="line.379"></a>
<span class="sourceLineNo">380</span>    }<a name="line.380"></a>
<span class="sourceLineNo">381</span>  }<a name="line.381"></a>
<span class="sourceLineNo">382</span><a name="line.382"></a>
<span class="sourceLineNo">383</span>  // calculated as 0xffffffffffffffff / radix<a name="line.383"></a>
<span class="sourceLineNo">384</span>  private static final long[] maxValueDivs = new long[Character.MAX_RADIX + 1];<a name="line.384"></a>
<span class="sourceLineNo">385</span>  private static final int[] maxValueMods = new int[Character.MAX_RADIX + 1];<a name="line.385"></a>
<span class="sourceLineNo">386</span>  private static final int[] maxSafeDigits = new int[Character.MAX_RADIX + 1];<a name="line.386"></a>
<span class="sourceLineNo">387</span>  static {<a name="line.387"></a>
<span class="sourceLineNo">388</span>    BigInteger overflow = new BigInteger("10000000000000000", 16);<a name="line.388"></a>
<span class="sourceLineNo">389</span>    for (int i = Character.MIN_RADIX; i &lt;= Character.MAX_RADIX; i++) {<a name="line.389"></a>
<span class="sourceLineNo">390</span>      maxValueDivs[i] = divide(MAX_VALUE, i);<a name="line.390"></a>
<span class="sourceLineNo">391</span>      maxValueMods[i] = (int) remainder(MAX_VALUE, i);<a name="line.391"></a>
<span class="sourceLineNo">392</span>      maxSafeDigits[i] = overflow.toString(i).length() - 1;<a name="line.392"></a>
<span class="sourceLineNo">393</span>    }<a name="line.393"></a>
<span class="sourceLineNo">394</span>  }<a name="line.394"></a>
<span class="sourceLineNo">395</span>}<a name="line.395"></a>




























































</pre>
</div>
</body>
</html>
